A 3D 12-subiteration thinning algorithm based on P-simple points
نویسندگان
چکیده
In this paper, we propose a new methodology to conceive a thinning scheme based on the parallel deletion of P-simple points. This scheme needs neither a preliminary labelling nor an extended neighborhood, in the opposite of the already proposed thinning algorithms based on P-simple points. Moreover, from an existent thinning algorithm A, we construct another thinning algorithm A′, such that A′ deletes at least all the points removed by A, while preserving the same end points. In fact, we propose a 12-subiteration thinning algorithm which deletes at least the points removed by the one proposed by Pal4 agyi and Kuba (Graphical Models Image Process. 61 (1999) 199). ? 2003 Elsevier B.V. All rights reserved.
منابع مشابه
Directional 3D Thinning Using 8 Subiterations
Thinning of a binary object is an iterative layer by layer erosion to extract an approximation to its skeleton. In order to provide topology preservation, different thinning techniques have been proposed. One of them is the directional (or border sequential) approach in which each iteration step is subdivided into subiterations where only border points of certain kind are deleted in each subite...
متن کاملA 3D 3-Subiteration Thinning Algorithm for Medial Surfaces
Thinning on a binary picture is an iterative layer by layer erosion to extract a reasonable approximation to its skeleton. This paper presents an efficient 3D parallel thinning algorithm which produces medial surfaces. Three–subiteration directional strategy is proposed: each iteration step is composed of three parallel subiterations according to the three deletion directions. The algorithm mak...
متن کاملA Parallel 12-Subiteration 3D Thinning Algorithm to Extract Medial Lines
Links: [1] https://www.inf.u-szeged.hu/biblio?f%5Bauthor%5D=757 [2] https://www.inf.u-szeged.hu/biblio?f%5Bauthor%5D=1017 [3] https://www.inf.u-szeged.hu/publication/a-parallel-12-subiteration-3d-thinning-algorithm-to-extrac t-medial-lines [4] https://www.inf.u-szeged.hu/biblio?f%5Bauthor%5D=464 [5] https://www.inf.u-szeged.hu/biblio?f%5Bauthor%5D=465 [6] https://www.inf.u-szeged.hu/biblio?f%5B...
متن کاملA Subiteration-Based Surface-Thinning Algorithm with a Period of Three
Thinning on binary images is an iterative layer by layer erosion until only the “skeletons” of the objects are left. This paper presents an efficient parallel 3D surface–thinning algorithm. A three–subiteration strategy is proposed: the thinning operation is changed from iteration to iteration with a period of three according to the three deletion directions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 139 شماره
صفحات -
تاریخ انتشار 2004